Fuzzy Partition Optimization for Approximate Fuzzy Q-iteration
نویسندگان
چکیده
منابع مشابه
Fuzzy partition optimization for approximate fuzzy Q-iteration
Reinforcement Learning (RL) is a widely used learning paradigm for adaptive agents. Because exact RL can only be applied to very simple problems, approximate algorithms are usually necessary in practice. Many algorithms for approximate RL rely on basis-function representations of the value function (or of the Q-function). Designing a good set of basis functions without any prior knowledge of th...
متن کاملADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...
متن کاملFuzzy hypergraph and fuzzy partition
In this paper, the concept of hypergraph is extended to the fuzzy hypergraph. In the fuzzy hypergraph, the concepts of a-cut hypergraph, strength of edge and dual fuzzy hypergraph are developed. It is shown that the fuzzy hypergraph and a-cut hypergraph are useful to represent a fuzzy partition. An application example also shows that the strength of edge can be used to decompose the data set in...
متن کاملFuzzy approximate continuity
Approximately continuous functions were first introduced in connection with problems of differentiation and integration. The main idea of the approximate continuity of a function f is that the continuity conditions are true not necessarily everywhere but only almost everywhere with respect to some measure, e.g., Borel measure or Lebesgue measure. At the same time, it is known that functions tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2008
ISSN: 1474-6670
DOI: 10.3182/20080706-5-kr-1001.00949